Maximal independent set

Results: 70



#Item
41Combinatorial optimization / NP-complete problems / Routing algorithms / Search algorithms / Matching / Randomized algorithm / Graph coloring / Connectivity / Dominating set / Mathematics / Theoretical computer science / Graph theory

70 CHAPTER 7. MAXIMAL INDEPENDENT SET Remarks: • Computing a maximum independent set (MaxIS) is a notoriously difficult

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:48
42NP-complete problems / Graph coloring / Edge coloring / Independent set / Dominating set / Combinatorial optimization / Search algorithms / Maximal independent set / Minimum spanning tree / Graph theory / Theoretical computer science / Mathematics

Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:46
43Combinatorial optimization / Routing algorithms / Search algorithms / Matching / Randomized algorithm / Graph coloring / Connectivity / Graph / A* search algorithm / Mathematics / Theoretical computer science / Graph theory

Chapter 7 Maximal Independent Set In this chapter we present a highlight of this course, a fast maximal independent set (MIS) algorithm. The algorithm is the first randomized algorithm that we study in this class. In di

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:48
44NP-complete problems / Vertex cover / Feedback vertex set / Independent set / Matching / Maximal independent set / Parameterized complexity / Algorithm / Dominating set / Theoretical computer science / Mathematics / Computational complexity theory

Iterative Compression and Exact Algorithms Fedor V. Fomin∗ Serge Gaspers† Mathieu Liedloff§

Add to Reading List

Source URL: www.dim.uchile.cl

Language: English - Date: 2009-10-29 15:21:24
45NP-complete problems / Graph coloring / Domatic number / Dominating set / Independent set / Greedy coloring / Topology / Maximal independent set / Graph / Graph theory / Theoretical computer science / Mathematics

CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximating the Independent Domatic Partition Problem in Random Geometric Graphs – An Experimental Study Dhia Mahjoub

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2010-07-19 10:46:18
46Distributed data storage / Maximal independent set / Independent set / Networks / Clique percolation method / Decomposition method / Graph theory / Theoretical computer science / Mathematics

PDF Document

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:49
47Clique / Interval graph / Independent set / Claw-free graph / Matching / Cograph / Path decomposition / Maximal independent set / Graph theory / NP-complete problems / Graph operations

Interval Scheduling and Colorful Independent Sets Ren´e van Bevern1,∗ , Matthias Mnich2 , Rolf Niedermeier1 , and Mathias Weller1,† 1 Institut f¨

Add to Reading List

Source URL: fpt.akt.tu-berlin.de

Language: English - Date: 2012-11-07 08:24:33
48Clique / Cograph / K-tree / Matching / Maximal independent set / Clique-sum / Graph theory / Graph operations / NP-complete problems

Image and Vision Computing–922 Contents lists available at ScienceDirect Image and Vision Computing journal homepage: www.elsevier.com/locate/imavis

Add to Reading List

Source URL: www.dsi.unive.it

Language: English - Date: 2010-08-27 12:14:18
49Chordal graph / Clique / Maximal independent set / Split graph / Tree decomposition / Cograph / Independent set / Neighbourhood / Clique-sum / Graph theory / Graph operations / NP-complete problems

Independent Set in P5-Free Graphs in Polynomial Time Daniel Lokshtanov∗ Martin Vatshelle∗ Yngve Villanger∗

Add to Reading List

Source URL: www.ii.uib.no

Language: English - Date: 2013-10-25 09:59:52
50Algebraic topology / Chordal graph / Clique complex / Graph / Vietoris–Rips complex / CW complex / Induced path / Maximal independent set / Simplicial complex / Graph theory / Mathematics / Topology

Algorithmic complexity of finding cross-cycles in flag complexes Michal Adamaszek, Juraj Stacho University of Warwick, UK Centre for Discrete Mathematics and its Applications (DIMAP)

Add to Reading List

Source URL: www.mimuw.edu.pl

Language: English - Date: 2015-03-23 03:34:03
UPDATE